golang.org/x/tools/go/ast/inspector.Cursor.index (field)

30 uses

	golang.org/x/tools/go/ast/inspector (current package)
		cursor.go#L40: 	index int32 // index of push node; -1 for virtual root node
		cursor.go#L87: 	if c.index < 0 {
		cursor.go#L90: 	return c.index
		cursor.go#L96: 	if c.index < 0 {
		cursor.go#L99: 	return c.in.events[c.index].node
		cursor.go#L107: 	if c.index < 0 {
		cursor.go#L115: 	if c.index < 0 {
		cursor.go#L118: 		return c.index, c.in.events[c.index].index + 1 // just one subtree
		cursor.go#L202: 	if c.index < 0 {
		cursor.go#L210: 		for i := c.index; i >= 0; i = events[i].parent {
		cursor.go#L222: 	if c.index < 0 {
		cursor.go#L226: 	return Cursor{c.in, c.in.events[c.index].parent}
		cursor.go#L240: 	if c.index < 0 {
		cursor.go#L244: 	pop := events[c.index].index
		cursor.go#L273: 	i := c.index + 1
		cursor.go#L291: 	if c.index < 0 {
		cursor.go#L306: 		for i := c.index + 1; events[i].index > i; i = events[i].index + 1 {
		cursor.go#L324: 	if c.index < 0 {
		cursor.go#L329: 	i := events[c.index].index + 1 // after corresponding pop
		cursor.go#L347: 	if c.index < 0 {
		cursor.go#L352: 	i := c.index - 1
		cursor.go#L365: 	i := c.index + 1                                   // i=0 if c is root
		cursor.go#L376: 	if c.index < 0 { // root?
		cursor.go#L382: 		j := events[c.index].index - 1 // before corresponding pop
		cursor.go#L385: 		if j > c.index { // c has children
		cursor.go#L435: 	return c.index <= c2.index && events[c2.index].index <= events[c.index].index